Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices

نویسنده

  • Volker Heun
چکیده

One of the most important open problems in computational biology is the prediction of the conformation of a protein based on its amino acid sequence. In this paper, we design approximation algorithms for protein structure prediction in the so-called HP side chain model. The major drawback of the standard HP side chain model is the bipartiteness of the cubic lattice. To eliminate this drawback, we introduce the extended cubic lattice that extends the cubic lattice by diagonals in the plane. For this lattice, we present two linear algorithms with approximation ratios of 59=70 and 37=42, respectively. The second algorithm is designed for a ‘natural’ subclass of proteins, which covers more than 99.5% of all sequenced proteins. This is the 9rst time that a protein structure prediction algorithm is designed for a ‘natural’ subclass of all combinatorial possible sequences. ? 2002 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lattice and Off-Lattice Side Chain Models of Protein Folding: Linear Time Structure Prediction Better than 86% of Optimal

This paper considers the protein energy minimization problem for lattice and off-lattice protein folding models that explicitly represent side chains. Lattice models of proteins have proven useful tools for reasoning about protein folding in unrestricted continuous space through analogy. This paper provides the first illustration of how rigorous algorithmic analyses of lattice models can lead t...

متن کامل

Protein Folding in the Generalized Hydrophobic-Polar Model on the Triangular Lattice

We consider the problem of determining the three-dimensional folding of a protein given its one-dimensional amino acid sequence. The model we use is based on the Hydrophobic-Polar (HP) model [2] on cubic lattices in which the goal is to find the fold with the maximum number of contacts between non-covalently linked hydrophobic amino acids. Hart and Istrail [5] give a 3/8 approximation algorithm...

متن کامل

Prediction of Protein Backbone Based on the Sliced Lattice Model

In the past decades, a significant number of studies on the prediction of protein 3D tertiary structures have been extensively made. However, the folding rules, the core issue of protein structure prediction, still stay unsolved. Given a target protein with its primary amino acid sequence, the protein backbone structure prediction (PSP) problem is to construct the 3D coordinates of α-carbon ato...

متن کامل

Producing High-Accuracy Lattice Models from Protein Atomic Coordinates Including Side Chains

Lattice models are a common abstraction used in the study of protein structure, folding, and refinement. They are advantageous because the discretisation of space can make extensive protein evaluations computationally feasible. Various approaches to the protein chain lattice fitting problem have been suggested but only a single backbone-only tool is available currently. We introduce LatFit, a n...

متن کامل

Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract)

Crystal lattices are in nite periodic graphs that occur naturally in a variety of geometries and which are of fundamental importance in polymer science. Discrete models of protein folding use crystal lattices to de ne the space of protein conformations. Because various crystal lattices provide discretizations of the same physical phenomenon, it is reasonable to expect that there will exist \inv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 127  شماره 

صفحات  -

تاریخ انتشار 1999